Query Answering for OWL-DL with Rules
نویسندگان
چکیده
Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, we present a decidable such combination where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in the rule body. We discuss the expressive power of such a combination and present an algorithm for query answering in the related logic SHIQ extended with DL-safe rules, based on a reduction to disjunctive programs.
منابع مشابه
Querying OWL 2 QL and Non-monotonic Rules
Answering (conjunctive) queries is an important reasoning task in Description Logics (DL), hence also in highly expressive ontology languages, such as OWL. Extending such ontology languages with rules, such as those expressible in RIF-Core, and further with non-monotonic rules, integrating default negation as described in the RIF-FLD, yields an even more expressive language that allows for mode...
متن کاملIntegrating Datalog with OWL: Exploring the AL-log Approach
We present OWL-log, which is an implementation of the ALlog hybrid knowledge representation system where the Description Logics component is extended to the Web Ontology Language OWL DL. We implemented an OWL-log reasoner coupled to the OWL reasoner Pellet and explored different query-answering strategies. We conducted an experimental study using a modified version of the LUBM benchmark in orde...
متن کاملAcyclicity Conditions and their Application to Query Answering in Description Logics
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a key problem in knowledge representation and databases. This problem can be solved using the chase (aka materialisation) algorithm; however, CQ answering is undecidable for general existential rules, so the chase is not guaranteed to terminate. Several acyclicity conditions provide sufficient conditions ...
متن کاملEfficient Query Answering over Fuzzy EL-OWL Based on Crisp Datalog Rewritable Fuzzy EL++
OWL EL is an extension of the tractable EL description logic. Despite their inference capabilities over TBoxes, DL reasoners have a high ABox reasoning complexity which may constitute a serious limitation in the Semantic Web where we rely mainly on query answering (i.e. instance checking). The subsomption algorithm used in fuzzy EL reduce instance checking into concept satisfiability. To allow ...
متن کاملExtending DL-Lite_A with (Singleton) Nominals
In this paper we study the extension of description logics of the DL-Lite family with singleton nominals, which correspond in OWL 2 to the ObjectHasValue construct. Differently from arbitrary (nonsingleton) nominals, which make query answering intractable in data complexity, we show that both knowledge base satisfiability and conjunctive query answering stay first-order rewritable when DL-LiteA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004